The cut-tree of large recursive trees
نویسنده
چکیده
Imagine a graph which is progressively destroyed by cutting its edges one after the other in a uniform random order. The so-called cut-tree records key steps of this destruction process. It can be viewed as a random metric space equipped with a natural probability mass. In this work, we show that the cut-tree of a random recursive tree of size n, rescaled by the factor n−1 lnn, converges in probability as n→∞ in the sense of GromovHausdorff-Prokhorov, to the unit interval endowed with the usual distance and Lebesgue measure. This enables us to explain and extend some recent results of Kuba and Panholzer [15] on multiple isolation of nodes in random recursive trees.
منابع مشابه
Limit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملPrediction of melting points of a diverse chemical set using fuzzy regression tree
The classification and regression trees (CART) possess the advantage of being able to handlelarge data sets and yield readily interpretable models. In spite to these advantages, they are alsorecognized as highly unstable classifiers with respect to minor perturbations in the training data.In the other words methods present high variance. Fuzzy logic brings in an improvement in theseaspects due ...
متن کاملComparison of damage to residual stand due to applying two different harvesting methods in the Hyrcanian forest of Iran: cut-to-length vs. tree length
Damage to residual stand is unavoidable and it is one of the main important issues in the forest harvesting. Trees damage may occur in felling and skidding work phase or during skid trail construction. In any case, damage can be very serious to residual stand. Detailed study is necessary to find out the amount and severity of damage to trees; therefore district 14 of Kilesara in Guilan Province...
متن کامل